Capturing a concave polygon with two disc-shaped fingers

نویسندگان

  • Attawith Sudsang
  • Thanaphon Luewirawong
چکیده

A successful grasp of an object can be guaranteed when the object can never escape from the surrounding fingers during the entire grasping execution. Ability to capture an object clearly contributes to the robustness and success of grasping tasks. Object concavity is a useful geometric property allowing objects to be captured with only few fingers. In particular, certain concave objects may be captured using two fingers by appropriately placing the fingers close to some pair of opposite concave sections. Based on this intuitive idea, we address the problem of capturing concave polygonal objects with two disc-shaped fingers. We present an approach for computing a range of distance such that the two fingers can move away from a given immobilizing grasp but still prevent the object from escaping; when within this computed range, it is guaranteed under the frictionless contact assumption that the fingers can move toward each other to bring the object to the given immobilizing grasp. The proposed approach is implemented and preliminary result is presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Caging Polygons with Two and Three Fingers

We present algorithms for computing all placements of two and three fingers that cage a given polygonal object with n edges in the plane. A polygon is caged when it is impossible to take the polygon to infinity without penetrating one of the fingers. Using a classification into squeezing and stretching cagings, we provide an algorithm that reports all caging placements of two disc fingers in O(...

متن کامل

Grasping Non-stretchable Cloth Polygons

In this paper, we examine non-stretchable 2D polygonal cloth, and place bounds on the number of fingers needed to immobilize it. For any non-stretchable cloth polygon, it is always necessary to pin all the convex vertices. We show that for some shapes, more fingers are necessary. No more than one third of the concave vertices need to be pinned for simple polygons, and no more than one third of ...

متن کامل

Dowker-type theorems for hyperconvex discs

A hyperconvex disc of radius r is a planar set with nonempty interior that is the intersection of closed circular discs of radius r. A convex disc-polygon of radius r is a set with nonempty interior that is the intersection of a finite number of closed circular discs of radius r. We prove that the maximum area and perimeter of convex disc-n-gons of radius r contained in a hyperconvex disc of ra...

متن کامل

CFD Study of Concave Turbine

Computational fluid dynamics (CFD) is a powerful numerical tool that is becoming widely used to simulate many processes in the industry. In this work study of the stirred tank with 7 types of concave blade with CFD was presented. In the modeling of the impeller rotation, sliding mesh (SM) technique was used and RNG-k-ε model was selected for turbulence. Power consumption in various speeds in th...

متن کامل

Wavelet-Based Image Compression with Polygon-Shaped Region of Interest

A wavelet-based lossy-to-lossless image compression technique with polygon-shaped ROI function is proposed. Firstly, split and mergence algorithms are proposed to separate concave ROIs into smaller convex ROIs. Secondly, row-order scan and an adaptive arithmetic coding are used to encode the pixels in ROIs. Thirdly, a lifting integer wavelet transform is used to decompose the original image in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003